A Fast Memory Efficient Construction Algorithm for Hierarchically Semi-Separable Representations
نویسندگان
چکیده
Existing Hierarchically Semi-Separable (HSS) construction algorithms for dense n×n matrices require as much as O(n2) peak workspace memory, at a cost of O(n2) flops. An algorithm is presented which requires O(n1.5) peak worskpace memory in the worst case, while still requiring only O(n2) flops.
منابع مشابه
Iterative solution methods based on the Hierarchically Semi-Separable Representation
In this paper, we study an important class of structured matrices: ”Hierarchically Semi-Separable (HSS)” matrices, for which an efficient hierarchical state based representation called Hierarchically Semi-Separable (HSS) representation can be used to utilize the data sparsity of the HSS matrices. A novel algorithm with O(n) complexity is proposed to construct suboptimal HSS representations from...
متن کاملAn O (N log N) Fast Direct Solver for Partial Hierarchically Semi-Separable Matrices - With Application to Radial Basis Function Interpolation
This article describes a fast direct solver (i.e., not iterative) for partial hierarchically semiseparable systems. This solver requires a storage of O(N logN) and has a computational complexity of O(N logN) arithmetic operations. The numerical benchmarks presented illustrate the method in the context of interpolation using radial basis functions. The key ingredients behind this fast solver are...
متن کاملA Fast Randomized Algorithm for Computing a Hierarchically Semiseparable Representation of a Matrix
Randomized sampling has recently been proven a highly efficient technique for computing approximate factorizations of matrices that have low numerical rank. This paper describes an extension of such techniques to a wider class of matrices that are not themselves rank-deficient, but have off-diagonal blocks that are; specifically, the class of so called Hierarchically Semi-Separable (HSS) matric...
متن کاملUsing multifrontal hierarchically solver and HPC systems for 3D Helmholtz problem
We present a multi-frontal hierarchically semi-separable solver to perform forward modeling of the 3D Helmholtz acoustic problem. Our frequency-domain solver combines two efficient approaches. First, it uses an optimal 27-point finite-difference scheme to decrease numerical dispersion and reduce required discretization of the model in terms of points per wavelength from 15 to about 4. Second, i...
متن کاملDirectional Multiresolution Image Representations
Efficient representation of visual information lies at the foundation of many image processing tasks, including compression, filtering, and feature extraction. Efficiency of a representation refers to the ability to capture significant information of an object of interest in a small description. For practical applications, this representation has to be realized by structured transforms and fast...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- SIAM J. Matrix Analysis Applications
دوره 37 شماره
صفحات -
تاریخ انتشار 2016